Concentration inequalities for Gibbs sampling under $d_{l_{2}}$-metric
نویسندگان
چکیده
منابع مشابه
Gibbs Sampling for Signal Reconstruction
This paper describes the use of stochastic simulation techniques to reconstruct biomedical signals not directly measurable. In particular, a deconvolution problem with an uncertain clearance parameter is considered. The problem is addressed using a Monte Carlo Markov Chain method, called the Gibbs Sampling, in which the joint posterior probability distribution of the stochastic parameters is es...
متن کاملGibbs Sampling for the Uninitiated
This document is intended for computer scientists who would like to try out a Markov Chain Monte Carlo (MCMC) technique, particularly in order to do inference with Bayesian models on problems related to text processing. We try to keep theory to the absolute minimum needed, and we work through the details much more explicitly than you usually see even in “introductory” explanations. That means w...
متن کاملAncestor Sampling for Particle Gibbs
We present a novel method in the family of particle MCMC methods that we refer to as particle Gibbs with ancestor sampling (PG-AS). Similarly to the existing PG with backward simulation (PG-BS) procedure, we use backward sampling to (considerably) improve the mixing of the PG kernel. Instead of using separate forward and backward sweeps as in PG-BS, however, we achieve the same effect in a sing...
متن کاملMixing Rates for Gibbs Sampling
Proof. Let x, y 2 ⌦ be two configurations. We will prove the claim for the visible conditional distributions. The proof for the hidden conditional distributions will follow symmetrically. For each visible node v i , let (X(v i ), Y (v i )) be the maximal coupling of P (v)(X(v i ) |x(h)) and P (v)(Y (v i ) | y(h)) guaranteed in Lemma 1. By doing this independently for all visible nodes, we have ...
متن کاملMetric inequalities for polygons
Let A1, A2, . . . , An be the vertices of a polygon with unit perimeter, that is ∑n i=1 |AiAi+1| = 1. We derive various tight estimates on the minimum and maximum values of the sum of pairwise distances, and respectively sum of pairwise squared distances among its vertices. In most cases such estimates on these sums in the literature were known only for convex polygons. In the second part, we t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Communications in Probability
سال: 2014
ISSN: 1083-589X
DOI: 10.1214/ecp.v19-3502